package usually;
//153. 寻找旋转排序数组中的最小值
public class Num153_findMin {
    public int findMin(int[] nums) {
        int l = 0;
        int r = nums.length - 1;
        while (l <= r){
            int mid = l + (r - l) / 2 ;
            if (nums[mid] > nums[l]){
                l = mid;
            }else {
                r = mid - 1;
            }
        }
        return nums[l];


    }
}
